How Tight Is the Bollobás-Komlós Conjecture?
نویسنده
چکیده
The bipartite case of the Bollob as and Koml os conjecture states that for every 0; > 0 there is an = ( 0; ) > 0 such that the following statement holds: If G is any graph with (G) n2 + n; then G contains as subgraphs all bipartite graphs, H; satisfying (H) 0 and b(H) n: Here b(H); the bandwidth of H, is the smallest b such that the vertices of H can be ordered as v1; : : : ; vn such that vi H vj implies ji jj b. This conjecture has been proved in [1]. In this note we show that this conjecture is tight in the sense that as ! 0 then ! 0. More precisely, we show that for any 1 100 there is a 0 such that that ( 0; ) 4 .
منابع مشابه
Proof of the Bandwidth Conjecture of Bollobás and Komlós
In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and integers r ≥ 1 and ∆, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ((r− 1)/r+ γ)n and H is an r-chromatic graph with n vertices, bandwidth at most βn and maximum degree at most ∆, then G contains a copy of H.
متن کاملSpanning 3-colourable subgraphs of small bandwidth in dense graphs
A conjecture by Bollobás and Komlós states the following: For every γ > 0 and integers r ≥ 2 and ∆, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ( r−1 r + γ)n and H is an r-chromatic graph with n vertices, bandwidth at most βn and maximum degree at most ∆, then G contains a copy of H. This conjecture generalises s...
متن کاملProof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs
A topological complete graph of order p comprises p vertices {v1, . . . , vp} and (p 2 ) pairwise vertex disjoint paths Pi, j , 1 ≤ i < j ≤ p, such that Pi, j joins vi to v j . It was conjectured by Mader [11], and also by Erdös and Hajnal [6], that there is a positive constant c such that any graph G of size at least cp2|G| contains a topological complete subgraph of order p. It was pointed ou...
متن کاملBandwidth theorem for random graphs
A graph G is said to have bandwidth at most b, if there exists a labeling of the vertices by 1, 2, . . . , n, so that |i − j| ≤ b whenever {i, j} is an edge of G. Recently, Böttcher, Schacht, and Taraz verified a conjecture of Bollobás and Komlós which says that for every positive r,∆, γ, there exists β such that if H is an n-vertex r-chromatic graph with maximum degree at most ∆ which has band...
متن کاملEdge Disjoint Hamilton Cycles
In the late 70s, it was shown by Komlós and Szemerédi ([7]) that for p = lnn+ln lnn+c n , the limit probability for G(n, p) to contain a Hamilton cycle equals the limit probability for G(n, p) to have minimum degree at least 2. A few years later, Ajtai, Komlós and Szemerédi ([1]) have shown a hitting time version of this in the G(n,m) model. Say a graph G has property H if it contains bδ(G)/2c ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 16 شماره
صفحات -
تاریخ انتشار 2000